Synchronous Games in the Situation Calculus
نویسندگان
چکیده
We develop a situation calculus-based account of multi-player synchronous games. These are represented as action theories called situation calculus synchronous game structures (SCSGSs) that involve a single action tick whose effects depend on the combination of moves chosen by the players. Properties of games, e.g., winning conditions, playability, weak and strong winnability, etc. can be expressed in a first-order variant of alternating-time mu-calculus. Computationally effective verification can be performed. SCSGSs can be viewed as a variant of the Game Description Language (GDL) where states are represented by first-order theories.
منابع مشابه
Situation Calculus Game Structures and GDL
We present a situation calculus-based account of multiplayers synchronous games in the style of general game playing. Such games can be represented as action theories of a special form, situation calculus synchronous game structures (SCSGSs), in which we have a single action tick whose effects depend on the combination of moves selected by the players. Then one can express properties of the gam...
متن کاملReasoning About General Games Described in GDL-II
Recently the general Game Description Language (GDL) has been extended so as to cover arbitrary games with incomplete/imperfect information. Learning—without human intervention—to play such games poses a reasoning challenge for general game-playing systems that is much more intricate than in case of complete information games. Action formalisms like the Situation Calculus have been developed fo...
متن کاملSynchronous Games, Simulations and λ-calculus
We refine a model for linear logic based on two well-known ingredients: games and simulations. We have already shown that usual simulation relations form a sound notion of morphism between games; and that we can interpret all linear logic in this way. One particularly interesting point is that we interpret multiplicative connectives by synchronous operations on games. We refine this work by giv...
متن کاملRelational Markov Games
Towards a compact and elaboration-tolerant first-order representation of Markov games, we introduce relational Markov games, which combine standard Markov games with first-order action descriptions in a stochastic variant of the situation calculus. We focus on the zero-sum two-agent case, where we have two agents with diametrically opposed goals. We also present a symbolic value iteration algor...
متن کاملSituation Calculus Based Programs for Representing and Reasoning about Game Structures
A wide range of problems, from contingent and multiagent planning to process/service orchestration, can be viewed as games. In many of these, it is natural to specify the possible behaviors procedurally. In this paper, we develop a logical framework for specifying these types of problems/games based on the situation calculus and ConGolog. The framework incorporates gametheoretic path quantifier...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015